| Definitions | s = t, t  T, ES, Type, AbsInterface(A),  , x:A  B(x),  b, P   Q,  x:A. B(x), sys-antecedent(es;Sys), fifo-antecedent(es;Sys;f), E(X), <a, b>, E, type List, chain-consistent(f;chain), x:A  B(x), left + right, case b of inl(x) => s(x) | inr(y) => t(y), if b then t else f fi , {x:A| B(x)} , P  Q, e  loc e' ,  x:A. B(x), Id, a < b,  A, P & Q, hd(l), L1  L2, adjacent(T;L;x;y), (x l), no_repeats(T;l), Top, e  X, X(e), f(a), effective(e),  , y is f*(x), cr-explanation{i:l}(es; Sys; f; e), !Void(), False, a:A fp B(a), strong-subtype(A;B), ||as||, A B,  ,  , l[i], A c B, [car / cdr], P  Q, P Q, last(L), loc(e), {T},  x:A.B(x), f(x)?z, Dec(P), l_disjoint(T;l1;l2), (e <loc e'), (e < e'), e c e', e<e'.P(e), ee'.P(e), e<e'. P(e), ee'.P(e), e[e1,e2).P(e), e[e1,e2).P(e), e[e1,e2].P(e), e[e1,e2].P(e), e(e1,e2].P(e), x dom(f), consistent-updates(es;In;Out;Cmd;isupdate;expl), EState(T),  , EqDecider(T), Unit, IdLnk, EOrderAxioms(E; pred?; info), kindcase(k; a.f(a); l,t.g(l;t) ), Knd, loc(e), kind(e), Msg(M), val-axiom(E;V;M;info;pred?;init;Trans;Choose;Send;val;time), r s, e < e', constant_function(f;A;B), SWellFounded(R(x;y)), pred!(e;e'),   x,y. t(x;y), pred(e), first(e), x. t(x), let x,y = A in B(x;y), t.1, ff, inr x , tt, inl x , True, x.A(x), Atom$n, MaName, x << y, sys-order(es; Sys; f), x before y l, a = b, n+m, #$n, Outcome, S T, n - m, |g|, i  j , -n, prior(X), b, as @ bs, p =b q, i <z j, i z j, (i = j), x =a y, null(as), a < b, x f y, a < b, [d], eq_atom$n(x;y), q_le(r;s), q_less(a;b), qeq(r;s), a = b, deq-member(eq;x;L), e = e', p q, p q, p q, [], A List , es-prior-fixedpoints{i:l}(es; Sys; f; e), s ~ t, sender(e),  T, SqStable(P), a =!x:T. Q(x), InvFuns(A;B;f;g), Inj(A;B;f), IsEqFun(T;eq), Refl(T;x,y.E(x;y)), Sym(T;x,y.E(x;y)), Trans(T;x,y.E(x;y)), AntiSym(T;x,y.R(x;y)), Connex(T;x,y.R(x;y)), CoPrime(a,b), Ident(T;op;id), Assoc(T;op), Comm(T;op), Inverse(T;op;id;inv), BiLinear(T;pl;tm), IsBilinear(A;B;C;+a;+b;+c;f), IsAction(A;x;e;S;f), Dist1op2opLR(A;1op;2op), fun_thru_1op(A;B;opa;opb;f), FunThru2op(A;B;opa;opb;f), Cancel(T;S;op), monot(T;x,y.R(x;y);f), IsMonoid(T;op;id), IsGroup(T;op;id;inv), IsMonHom{M1,M2}(f), a b, IsIntegDom(r), IsPrimeIdeal(R;P), f g, f**(e), es-vartype(es; i; x), es-state(es; i), decl-state(ds), ma-state(ds), rcv(l; tg), locl(a), y=f*(x) via L, isrcv(e), kind(e), es-first-from(es;e;l;tg), isrcv(k), lastchange(x;e), (last change to x before e), SQType(T), b | a, a ~ b, a b, a <p b, a < b, xL. P(x), (xL.P(x)), r < s, q-rel(r;x),  , first(e), source(l), destination(l), es-init(es;e), {i..j }, e(e1,e2].P(e), @e(x v), pred(e), suptype(S; T), x <<= y |
| Lemmas | chain-order-total2, es-is-prior-interface, decidable es-le, chain-consistent-out-continuity, chain-consistent-continuity, chain-order-le wf, chain-order-antireflexive, es-locl irreflexivity, fun-connected-fixedpoint, es-locl transitivity2, es-le weakening, kind wf, first wf, es-prior-interface-val-locl, chain-path-ordered-same-loc2, chain-path-query, chain-consistent-after-input, es-causl transitivity2, es-causle-le, es-le weakening eq, es-causle weakening locl, es-causl transitivity1, chain-order-total, decidable es-locl, es-le-not-locl, es-first wf, es-loc-pred, es-locl-iff, es-le-prior-interface-val, chain-consistent-effective-continuity, chain-path-member-not-input, decidable assert, Id sq, es-isrcv-loc, es-le-loc, es-fix property, es-le-causle, es-fix wf, strong-subtype-set3, strong-subtype wf, strong-subtype-self, es-fix wf2, fun-path wf, fun-connected wf, squash wf, sq stable all, sq stable from decidable, decidable es-causle, es-prior-interface-val, es-causl weakening, es-fix-causle, es-prior-fixedpoints-fix, member append, es-interface-val wf, length wf1, assert-es-eq-E-2, es-eq-E wf, eqtt to assert, iff transitivity, eqff to assert, assert of bnot, es-prior-interface wf, bnot wf, member singleton, ge wf, nat properties, chain-consistent-order, es-causl-swellfnd, nat ind tp, guard wf, le wf, all functionality wrt iff, implies functionality wrt iff, not functionality wrt iff, assert-eq-id, iff wf, rev implies wf, eq id wf, es-causl wf, l before wf, chain-order wf, es-locl wf, es-le wf, false wf, es-interface-val wf2, es-le-total, cr-explanation wf, cr-explanation-es-le, decidable equal Id, es-loc wf, fifo-antecedent wf, chain-consistent wf, consistent-updates wf, event system wf, sys-antecedent wf, es-E-interface-subtype rel, es-causle wf, true wf, btrue wf, bfalse wf, es-is-interface wf, es-E wf, deq wf, EOrderAxioms wf, IdLnk wf, Msg wf, unit wf, val-axiom wf, qle wf, cless wf, bool wf, Knd wf, kindcase wf, constant function wf, not wf, loc wf, pred! wf, strongwellfounded wf, rationals wf, Id wf, EState wf, chain-consistent-updates1, decidable l member, decidable equal es-E-interface, es-interface-subtype rel, l member subtype, length wf nat, nat wf, select wf, member wf, top wf, es-interface wf, subtype rel wf, l member wf, es-E-interface wf, cr-effective wf, assert wf |
